Optimal static priority rules for stochastic scheduling with impatience
نویسندگان
چکیده
منابع مشابه
Optimal static priority rules for stochastic scheduling with impatience
We consider a stochastic scheduling problem with impatience to the end of service or impatience to the beginning of service. The impatience of a job can be seen as a stochastic due date. Processing times and due dates are random variables. Jobs are processed on a single machine with the objective to minimize the expected weighted number of tardy jobs in the class of static list scheduling polic...
متن کاملStatic-priority Scheduling on Multiprocessors
This thesis deals with the problem of scheduling a set of tasks to meet deadlines on a computer with multiple processors. Static-priority scheduling is considered, that is, a task is assigned a priority number that never changes and at every moment the highestpriority tasks that request to be executed are selected for execution. The performance metric used is the capacity that tasks can request...
متن کاملApproximation in Stochastic Scheduling: the Power of Lp-based Priority Rules Approximation in Stochastic Scheduling: the Power of Lp-based Priority Rules
We address the problem of minimizing the total weighted completion time in stochastic machine scheduling. A set of jobs has to be processed on identical parallel machines, job processing times are drawn from some known probability distribution, and the aim is to find a scheduling strategy that minimizes the objective in expectation. The overall driving question is: What is the performance of si...
متن کاملEfficient Optimal Priority Assignment for Fixed Priority Preemption Threshold Scheduling
This paper proposes an efficient priority assignment algorithm for fixed priority preemption threshold scheduling (PTS), which we named FAST-TRAVERSE. It is optimal in the sense that it always finds a feasible priority assignment if one exists. While there are existing optimal algorithms, they are inefficient to be used in practice. The key ideas of FAST-TRAVERSE are to prune sibling traverses ...
متن کاملStatic-priority scheduling of multiframe tasks
The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of Liu and Layland (Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), pp. 46{61. 1973 ). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2013
ISSN: 0167-6377
DOI: 10.1016/j.orl.2012.11.008